Algorithms for Computation of the Burstiness Curve of Video
نویسندگان
چکیده
The burstiness of a video source can be characterized by its burstiness curve. The burstiness curve is useful in the optimal allocation of resources to satisfy a desired quality of service for the video stream in a packet network. In this paper, we present deterministic algorithms for exact computation of the burstiness curve of a video source, for both elementary video streams and MPEG-2 Transport Streams. The algorithms exploit the piecewise linearity of the burstiness curve and compute only the points at which the slope of the burstiness curve c hanges. We also present approximate versions of these algorithms, which save computational eeort by considering only a small numberof candidate points at which the slope of the burstiness curve may change. The eeciency of the proposed algorithms makes them suitable for QoS provisioning not only in oo-line environments such as in Video-on-Demand VoD servers, but also in real-time applications such as live TV distribution systems.
منابع مشابه
Resource Allocation for Video Streaming in Wireless Environment
This paper focuses on the development of a new resource allocation scheme for video streaming in wireless networks. The technique utilizes the 2-weak burstiness curve which has been defined as the (1− 2)-percentile of the maximum burstiness curve. We show that the 2-weak burstiness curve is a convex non-increasing function of the service rate. We also devise a “water-filling” algorithm to obtai...
متن کاملTwo Novel Chaos-Based Algorithms for Image and Video Watermarking
In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...
متن کاملLearning Curve Consideration in Makespan Computation Using Artificial Neural Network Approach
This paper presents an alternative method using artificial neural network (ANN) to develop a scheduling scheme which is used to determine the makespan or cycle time of a group of jobs going through a series of stages or workstations. The common conventional method uses mathematical programming techniques and presented in Gantt charts forms. The contribution of this paper is in three fold. First...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملNormalized Tenacity and Normalized Toughness of Graphs
In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters. Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999